Life Extending Minimum-Time Path Planning for Hexapod Robot

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Life Extending Minimum-Time Path Planning for Hexapod Robot

This paper presents a minimum‐time path planning scheme for life‐extending operation of legged robots, illustrated with a six‐legged walking robot (hexapod). The focus of this study is on extending the bearing fatigue life for leg joints. As a typical treatment, the minimum‐time path planning is performed through a bisecting‐plane (BP) algorithm with the co...

متن کامل

Near-Minimum-Time Motion Planning of Manipulators along Specified Path

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

متن کامل

Extending the VGRAPH Algorithm for Robot Path Planning

This paper presents an O(nlogm) method to incorporate start and goal points of a robot into the roadmap of a two-dimensional workspace to form a VGRAPH. A VGRAPH Point Incorporation Algorithm(VPIA) incorporates a point in free-space into a roadmap. This VPIA divides the free space around an obstacle vertex into an ordered set of areas. A search is used to determine the containment of the point....

متن کامل

near-minimum-time motion planning of manipulators along specified path

the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...

متن کامل

On-line near minimum-time path planning and control of an industrial robot for picking fruits

To be competitive, an industrial robot picking fruits must be able to perform this task in an amount of time which compares to that needed by humans. Because the location of a fruit changes due to the picking of others, the determination of their location has to be performed on-line and also the associated path planning for the robot. This poses two major problems in the development of fruit-pi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Advanced Robotic Systems

سال: 2011

ISSN: 1729-8814,1729-8814

DOI: 10.5772/10569